Improving Clustering Performance Using Gene Ontology
نویسندگان
چکیده
منابع مشابه
Improving Classification Accuracy Using Gene Ontology Information
Classification problems, e.g., gene function prediction problem, are very important in bioinformatics. Previous work mainly focuses on the improvement of classification techniques used. With the emergence of Gene Ontology (GO), extra knowledge about the gene products can be extracted from GO. Such kind of knowledge reveals the relationship of the gene products and is helpful for solving the cla...
متن کاملImproving clustering performance using multipath component distance
The problem of identifying clusters from MIMO measurement data is addressed. Conventionally, visual inspection has been used for cluster identification, but this approach is impractical for a large amount of measurement data. For automatic clustering, the multipath component distance (MCD) is used to calculate the distance between individual multipath components estimated by a channel parameter...
متن کاملA Study On Semantic Similarity Of Gene Ontology Using Clustering
Gene Ontology is structured as a directed acyclic graph, and each expression has distinct interaction to one or more other terms in the same domain and sometimes to other domains. High throughput techniques have become a primary approach to gathering biological data. These data can be used to explore relationships between genes and to identify disease. Clustering is a common methodology for the...
متن کاملOn using cache conscious clustering for improving OODBMS performance
The two main techniques of improving I/O performance of Object Oriented Database Management Systems(OODBMS) are clustering and buffer replacement. Clustering is the placement of objects accessed near to each other in time into the same page. Buffer replacement involves the selection of a page to be evicted, when the buffer is full. The page evicted ideally should be the page needed least in the...
متن کاملImproving Performance in Combinatorial Optimisation Using Averaging and Clustering
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was shown to be an extremely effective search strategy, substantially out-performing traditional optimisation techniques. In this paper we extend those ideas to a second classic NP-Hard problem, namely Vertex Cover. Again t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2009
ISSN: 1976-9172
DOI: 10.5391/jkiis.2009.19.6.802